Modification of Edmonds' maximum matching algorithm
نویسندگان
چکیده
منابع مشابه
Modification of Edmonds ' Maximum Matching Algorithm
Edmonds d e veloped an efficient a lgorithm for finding in a given graph C a mat c hing of maximum cardinality. Thi s algorithm "s hrinks" part s of the graph C. Although helpful to the intuitive unde rstanding of the theory, s hrinking is compl icated to im plem e nt on an e l<!'c troni c comput e rThe modificati on presente d in thi s paper avoids s hrinking_ It e mploys ins tead a treelik e ...
متن کامل2 Edmonds ’ Algorithm for Maximum Matching 3 Minimum Edge Covers
Any set of vertices V ′ with {{u, v} : u ∈ V ′} (smallest or otherwise) is called a vertex cover of the graph. Intuitively, a cover is a dusting of vertices so that every edge in the graph is “covered” by some vertex, although you might also say that each edge is “hit” by some vertex. Note that vertex cover is a minimization problem, with the goal to find a vertex cover that is as small as poss...
متن کاملAn Efficient Implement at ion of Edmonds’ Maximum -Matching
A matching in a graph is a collection of edges, no two of which share a
متن کاملFormalizing the Edmonds-Karp Algorithm
We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL — the interactive theorem prover used for the formalization. We then use stepwise refinement to obtain the Edmonds-Karp algorithm, and formally prove a bound on its complexi...
متن کاملDistributed algorithm for approximating the maximum matching
We present a distributed algorithm that finds a matching M of size which is at least 2/3|M | where M ∗ is a maximum matching in a graph. The algorithm runs in O(log n) steps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
سال: 1965
ISSN: 0022-4340
DOI: 10.6028/jres.069b.009